Graph Compression by BFS
نویسندگان
چکیده
The Web Graph is a large-scale graph that does not fit in main memory, so that lossless compression methods have been proposed for it. This paper introduces a compression scheme that combines efficient storage with fast retrieval for the information in a node. The scheme exploits the properties of the Web Graph without assuming an ordering of the URLs, so that it may be applied to more general graphs. Tests on some datasets of use achieve space savings of about 10% over existing methods.
منابع مشابه
Optimizing Communication by Compression for Multi-GPU Scalable Breadth-First Searches
The Breadth First Search (BFS) algorithm is the foundation and building block of many higher graph-based operations such as spanning trees, shortest paths and betweenness centrality. The importance of this algorithm increases each day due to it is a key requirement for many data structures which are becoming popular nowadays. When the BFS algorithm is parallelized by distributing the graph betw...
متن کاملOn the bias of BFS
Breadth First Search (BFS) is widely used for measuring large unknown graphs, such as Online Social Networks. It has been empirically observed that an incomplete BFS is biased toward high degree nodes. In contrast to more studied sampling techniques, such as random walks, the precise bias of BFS has not been characterized to date. In this paper, we quantify the degree bias of BFS sampling. In p...
متن کاملThe Nature of Breadth - First
BFS is one of the classical graph theory algorithms, typically expressed under the imperative style. However, it has applications in other domains such as artiicial intelligence. All known algorithms of BFS use iteration. This article focuses on the information maintained by BFS during exploration of an arbitrary graph component. To better understand the structure of this information, BFS is re...
متن کاملThe More the Merrier: Efficient Multi-Source Graph Traversal
Graph analytics on social networks, Web data, and communication networks has been widely used in a plethora of applications. Many graph analytics algorithms are based on breadth-first search (BFS) graph traversal, which is not only time-consuming for large datasets but also involves much redundant computation when executed multiple times from different start vertices. In this paper, we propose ...
متن کاملMultiple Source Dual Fault Tolerant BFS Trees
Let G = (V,E) be a graph with n vertices and m edges, with a designated set of σ sources S ⊆ V . The fault tolerant subgraph for any graph problem maintains a sparse subgraph H = (V,E) of G with E ⊆ E, such that for any set F of k failures, the solution for the graph problem on G\F is maintained in its subgraph H \F . We address the problem of maintaining a fault tolerant subgraph for computing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Algorithms
دوره 2 شماره
صفحات -
تاریخ انتشار 2009